All Regular Multigraphs of Even Order and High Degree Are 1-factorable
نویسندگان
چکیده
Plantholt and Tipnis (1991) proved that for any even integer r, a regular multigraph G with even order n, multiplicity μ(G) ≤ r and degree high relative to n and r is 1-factorable. Here we extend this result to include the case when r is any odd integer. Häggkvist and Perković and Reed (1997) proved that the One-factorization Conjecture for simple graphs is asymptotically true. Our techniques yield an extension of this asymptotic result on simple graphs to a corresponding asymptotic result on multigraphs.
منابع مشابه
Regular Multigraphs of High Degree Are 1-factorizable
Chetwynd and Hilton showed that any regular simple graph with even order n and maximum degree at least \n has chromatic index equal to its maximum degree. We show how to extend this result to general multigraphs, including those of odd order. This also verifies a special case of conjectures by Goldberg and Seymour.
متن کاملList Edge Colourings of Some 1-Factorable Multigraphs
The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and any set system fSe : e 2 E(G)g with each jSej = k, we can choose elements se 2 Se such that se 6 = sf whenever e and f are adjacent edges. Using a technique of Alon and Tarsi which involves the graph monomial Q fxu ? xv : uv 2 Eg of an oriented graph, we verify this conjecture for certain families...
متن کاملSharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs
The Chinese Postman Problem in a multigraph is the problem of finding a shortest closed walk traversing all the edges. In a (2r + 1)-regular multigraph, the problem is equivalent to finding a smallest spanning subgraph in which all vertices have odd degree. In 1994, Kostochka and Tulai established a sharp upper bound for the solution. In this paper, we give simple proofs of their bounds for 3-r...
متن کاملOn the edge coloring of graph products
All graphs under consideration are nonnull, finite, undirected, and simple graphs. We adopt the standard notations dG(v) for the degree of the vertex v in the graph G, and ∆(G) for the maximum degree of the vertices of G. The edge chromatic number, χ′(G), of G is the minimum number of colors required to color the edges of G in such a way that no two adjacent edges have the same color. A graph i...
متن کاملThe chromatic index of multigraphs of order at most 10
The maximum of the maximum degree and the 'odd set quotients' provides a well-known lower bound 4)(G) for the chromatic index of a multigraph G. Plantholt proved that if G is a multigraph of order at most 8, its chromatic index equals qS(G) and that if G is a multigraph of order 10, the chromatic index of G cannot exceed qS(G) + 1. We identify those multigraphs G of order 9 and 10 whose chromat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 8 شماره
صفحات -
تاریخ انتشار 2001